A Group Norm Regularized Factorization Model for Subspace Segmentation
نویسندگان
چکیده
منابع مشابه
Safe Subspace Screening for Nuclear Norm Regularized Least Squares Problems
Nuclear norm regularization has been shown very promising for pursing a low rank matrix solution in various machine learning problems. Many efforts have been devoted to develop efficient algorithms for solving the optimization problem in nuclear norm regularization. Solving it for large-scale matrix variables, however, is still a challenging task since the complexity grows fast with the size of...
متن کاملTitle Subspace segmentation with a minimal square frobenius norm
We introduce a novel subspace segmentation method called Minimal Squared Frobenius Norm Representation (MSFNR). MSFNR performs data clustering by solving a convex optimization problem. We theoretically prove that in the noiseless case, MSFNR is equivalent to the classical Factorization approach and always classifies data correctly. In the noisy case, we show that on both synthetic and real-word...
متن کاملSupplementary Material for Safe Subspace Screening for Nuclear Norm Regularized Least Squares Problems
Here, we give the detailed derivation of the dual problem of Eq. (2). First, we rewrite it as the following equivalent constrained optimization problem min 1 2 Z 2 F + λ W * s.t. Z = XW − Y (S1) Let us introduce the dual variable λP ∈ R n×m for the equality constraint, then the Lagrangian of Eq. (S1) can be written as L
متن کاملRegularized subspace n-gram model for phonotactic ivector extraction
Phonotactic language identification (LID) by means of n-gram statistics and discriminative classifiers is a popular approach for the LID problem. Low-dimensional representation of the n-gram statistics leads to the use of more diverse and efficient machine learning techniques in the LID. Recently, we proposed phototactic iVector as a low-dimensional representation of the n-gram statistics. In t...
متن کاملNorm and Hessian Regularized Non-Negative Matrix Factorization with Discriminability for Data Representation
Matrix factorization based methods have widely been used in data representation. Among them, Non-negative Matrix Factorization (NMF) is a promising technique owing to its psychological and physiological interpretation of spontaneously occurring data. On one hand, although traditional Laplacian regularization can enhance the performance of NMF, it still suffers from the problem of its weak extra...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2020
ISSN: 2169-3536
DOI: 10.1109/access.2020.3000816